Imaging in Random Media with Convex Optimization
نویسندگان
چکیده
منابع مشابه
Imaging in Random Media with Convex Optimization
We study an inverse problem for the wave equation where localized wave sources in random scattering media are to be determined from time resolved measurements of the waves at an array of receivers. The sources are far from the array, so the measurements are a↵ected by cumulative scattering in the medium, but they are not further than a transport mean free path, which is the length scale charact...
متن کاملImaging in Random Media
We give a self-contained presentation of coherent array imaging in random media, which are mathematical models of media with uncertain small scale features (inhomogeneities). We describe the challenges of imaging in random media and discuss the coherent interferometric (CINT) imaging approach. It is designed to image with partially coherent waves, so it works at distances that do not exceed a t...
متن کاملOptimization of Convex Functions with Random Pursuit
We consider unconstrained randomized optimization of convex objective functions. We analyze the Random Pursuit algorithm, which iteratively computes an approximate solution to the optimization problem by repeated optimization over a randomly chosen one-dimensional subspace. This randomized method only uses zeroth-order information about the objective function and does not need any problem-speci...
متن کاملOrgan dose in kidney imaging with contrast media
Introduction:Intravenous urography (IVU) test includes high number of images and extended imaging size. These make IVU as a diagnostic method with high absorbed doses by sensitive organs such as intestine and gonads in pelvic-abdominal area. In this study absorbed doses of pelvic-abdomen sensitive organs such as Adrenal, Bladder, Colon and Gonads in IVU test. <stron...
متن کاملExact Optimization for Markov Random Fields with Convex Priors
We introduce a method to solve exactly a first order Markov Random Field optimization problem in more generality than was previously possible. The MRF shall have a prior term that is convex in terms of a linearly ordered label set. The method maps the problem into a minimum-cut problem for a directed graph, for which a globally optimal solution can be found in polynomial time. The convexity of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Imaging Sciences
سال: 2017
ISSN: 1936-4954
DOI: 10.1137/16m1085322